-
1 finite connectivity
-
2 finite connectivity
матем. -
3 of finite connectivity
конечносвязныйБольшой англо-русский и русско-английский словарь > of finite connectivity
-
4 of finite connectivity
-
5 of finite connectivity
Математика: конечносвязныйУниверсальный англо-русский словарь > of finite connectivity
-
6 domain of finite connectivity
Математика: конечносвязная областьУниверсальный англо-русский словарь > domain of finite connectivity
-
7 domain of finite connectivity
матем.English-Russian scientific dictionary > domain of finite connectivity
-
8 connectivity
мат.number of connectivity —
-
9 finite
1) ограниченный
2) блочный конечный
3) финитный
4) конечно
5) финитарный
– finite automaton
– finite chain
– finite circuit
– finite difference
– finite dimensionality
– finite discontinuity
– finite graph
– finite group
– finite increment
– finite over
– finite quantity
– finite scheme
– is finite
– of finite branching
– of finite connectivity
– of finite genus
– of finite multiplicity
– pointwise finite
algebra of finite order — <math.> алгебра конечного ранга
finite difference approximation — конечно-разностное приближение
finite element method — <math.> метод конечных элементов
wing of finite span — <phys.> крыло конечного размаха
-
10 connectivity
-
11 finite element connectivity
Универсальный англо-русский словарь > finite element connectivity
-
12 finite-element model connectivity
English-russian dictionary of physics > finite-element model connectivity
-
13 domain
1) владение, имение2) территория, зона3) физ. домен4) область, сфера5) матем. область определения6) область, домен• -
14 number
1) число || числовой2) номер || нумеровать3) код числа4) количество5) колонцифра6) численность || считать, подсчитывать, исчислять8) числительное•a great number of — множество, большое количество
a number of — (целый) ряд, некоторое количество
- absolutely pseudoprime number - connectivity number - deficient number - edge attachment number - edge covering number - edge sensitivity number - expected sample number - general recursively irrational number - geodesic crossing number - integer number - integral number - internal stability number - international customer number - mass exchange number - mixed-radix number - Mohs hardness number - number of principal cotype - number of space dimensions - octonary number - one-digit number - one-figure number - one's complement number - rectilinear crossing number - recursively real number - serial number - Shore hardness number - strictly positive number - vertex covering numberwinding number of a curve with respect to the point — порядок кривой относительно точки (число оборотов вектора, соединяющего данную точку с точкой кривой при обходе кривой)
-
15 graph
1) график; диаграмма; кривая; номограмма2) граф3) лингв. вариант графемы•- acyclic graph
- alternating graph
- AND-OR graph
- bar graph - bipartite graph
- bunch graph
- Caley graph
- circuit-free graph
- circulant graph
- circular graph
- closed graph
- color graph
- complementary graph
- complete graph
- computation graph
- connected graph
- connectivity graph
- control flow graph
- data flow program graph
- data-flow graph - directed graph
- E-graph
- extremal graph
- finite graph
- flat graph
- flow graph
- game graph
- harward graph
- indirected graph
- infinite graph
- information graph
- irregular graph
- labeled graph
- line graph
- linear graph
- locally finite graph
- marked points graph
- monochromatic graph
- multidimensional graph
- N-chromatic graph
- network graph
- net graph
- node-symmetric graph
- object graph
- ordered graph
- oriented graph
- pattern graph
- planar graph
- processing graph
- product graph
- regular graph of degree N
- regular graph
- scene graph
- section graph
- signal-flow graph
- singular graph
- software graph
- spectral decision graph
- stacked bar graph
- stacked graph
- state graph
- strongly connected graph
- task graph
- total graph
- transaction graph
- transition graph
- tree graph
- two-dimensional graph
- undirected graph
- vertex-weighted graph
- weighted directed graph
- word graphEnglish-Russian dictionary of computer science and programming > graph
-
16 degree
1) градус2) матем. степень; порядок3) сорт, качество4) диплом5) степень, уровень; ступень•degrees to port — мор. градусы левого борта
degrees to starboard — мор. градусы правого борта
to some degree — до некоторой степени; в известной мере
См. также в других словарях:
Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… … Wikipedia
Σ-finite measure — In mathematics, a positive (or signed) measure mu; defined on a sigma; algebra Sigma; of subsets of a set X is called finite, if mu;( X ) is a finite real number (rather than ∞). The measure mu; is called σ finite, if X is the countable union of… … Wikipedia
Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Menger's theorem — In the mathematical discipline of graph theory and related areas, Menger s theorem is a basic result about connectivity in finite undirected graphs. It was proved for edge connectivity and vertex connectivity by Karl Menger in 1927. The edge… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
Spatial twist continuum — The spatial twist continuum is a dual representation of an all hexahedral mesh that defines the global connectivity constraint. Discovered by Dr. Peter Murdoch on the 16th September 1993, the spatial twist continuum is a method that can be used… … Wikipedia
Border Gateway Protocol — BGP redirects here. For the Formula One Team, see Brawn GP. The Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or prefixes which designate network reachability … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia